The classification of finite groups by using iteration digraphs
نویسندگان
چکیده
منابع مشابه
buckling of viscoelastic composite plates using the finite strip method
در سال های اخیر، تقاضای استفاده از تئوری خطی ویسکوالاستیسیته بیشتر شده است. با افزایش استفاده از کامپوزیت های پیشرفته در صنایع هوایی و همچنین استفاده روزافزون از مواد پلیمری، اهمیت روش های دقیق طراحی و تحلیل چنین ساختارهایی بیشتر شده است. این مواد جدید از خودشان رفتارهای مکانیکی ارائه می دهند که با تئوری های الاستیسیته و ویسکوزیته، نمی توان آن ها را توصیف کرد. این مواد، خواص ویسکوالاستیک دارند....
A Simple Classification of Finite Groups of Order p2q2
Suppose G is a group of order p^2q^2 where p>q are prime numbers and suppose P and Q are Sylow p-subgroups and Sylow q-subgroups of G, respectively. In this paper, we show that up to isomorphism, there are four groups of order p^2q^2 when Q and P are cyclic, three groups when Q is a cyclic and P is an elementary ablian group, p^2+3p/2+7 groups when Q is an elementary ablian group an...
متن کاملThe classification of finite and locally finite connected-homogeneous digraphs
We classify the finite connected-homogeneous digraphs, as well as the infinite locally finite such digraphs with precisely one end. This completes the classification of all the locally finite connected-homogeneous digraphs.
متن کاملClassification of Finite Simple Groups
Analogous to the way the integers can be decomposed uniquely into prime factors, finite groups can be decomposed into finite simple groups, which cannot be further decomposed nontrivially. We will prove the JordanHölder Theorem and show that finite groups can always be decomposed uniquely into finite simple groups, and discuss the classification of these groups. In particular, we will discuss t...
متن کاملCayley Digraphs of Finite Abelian Groups and Monomial Ideals
In the study of double-loop computer networks, the diagrams known as L-shapes arise as a graphical representation of an optimal routing for every graph’s node. The description of these diagrams provides an efficient method for computing the diameter and the average minimum distance of the corresponding graphs. We extend these diagrams to multiloop computer networks. For each Cayley digraph with...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Czechoslovak Mathematical Journal
سال: 2016
ISSN: 0011-4642,1572-9141
DOI: 10.1007/s10587-016-0312-8